2 On The Usefulness of Hard Problems
نویسنده
چکیده
As you probably already know, there is an active discussion going o n i n forums ranging from lunch-table conversations to workshops on "strategic directions" to formal r epo r t s l r ega rd ing the future of theoret ical computer science. Since your complexity columnist does not know The Answer, I 've asked a number of people to contr ibute their comments on the narrower issue of the future of complexity theory. The only ground rule was a loose 1-page limit; each contr ibutor could choose what aspect(s) of the future to address, and the way in which to address them. The first instal lment of contributions appears in this issue, and one or two more installments will appear among the next few issues. Also coming during the next few issues: the search for the perfect theory journal , and (for the sharp-eyed) Lance Fortnow dons a clown suit. Finally, let me mention tha t work of Russell Impagliazzo resolves one of the open questions from Complexity Theory Column 11.2
منابع مشابه
The evaluation of reading problems in hearing impaired students: A systematic review of past studies
Abstract Background and Aim: The aim of this systematic review was to investigate the characteristics of deaf and hard of hearing students with reading difficulties. Methods: The research method was a systematic review of the statistical population including all internal and external researches that used the keywords of deaf and hard of hearing students and reading problems in the database...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملA PFIH-Based Heuristic for Green Routing Problem with Hard Time Windows
Transportation sector generates a considerable part of each nation's gross domestic product and considered among the largest consumers of oil products in the world. This paper proposes a heuristic method for the vehicle routing problem with hard time windows while incorporating the costs of fuel, driver, and vehicle. The proposed heuristic uses a novel speed optimization algorithm to reach its ...
متن کاملتوانش های شناخت، نظریه ذهن و حافظه دیداری در کودکان کم شنوا
Hearing problems in children hard of hearing, in addition to communication skills, will effect social interaction too. One aspect of social recognition which has attracted an increasing attention in recent years is the development of children's intelligence theory. In connection with intellectual and recognition abilities in children hard of hearing, intelligence is a subject that has always be...
متن کاملEstimation of Fracture path in the Structures and the Influences of Non-singular term on crack propagation
In the present research, a fully Automatic crack propagation as one of the most complicated issues in fracture mechanics is studied whether there is an inclusion or no inclusion in the structures. In this study The Extended Finite Element Method (XFEM) is utilized because of several drawbacks in standard finite element method in crack propagation modeling. Estimated Crack paths are obtained by ...
متن کاملRobotic surgery: change in new surgery techniques
Medical science experts have reached scientific and technological improvements in recent ‎decades and have turned surgery into a routine treatment by controlling its complications. ‎Cumulative changes in surgery resulted in decreased pain and discomfort and controlled ‎complications. The developmental path and changes have resulted in endoscopic with minimal ‎invasive surgery (M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002